A nearly optimal discrete query quantum algorithm for evaluating NAND formulas
نویسنده
چکیده
We present an O( √ N) discrete query quantum algorithm for evaluating balanced binary NAND formulas and an O(N 1 2 +O( 1 √ log N ) ) discrete query quantum algorithm for evaluating arbitrary binary NAND formulas.
منابع مشابه
The Quantum Query Complexity of Read-Many Formulas
The quantum query complexity of evaluating any read-once formula with n black-box input bits is Θ( √ n). However, the corresponding problem for read-many formulas (i.e., formulas in which the inputs have fanout) is not well understood. Although the optimal read-once formula evaluation algorithm can be applied to any formula, it can be suboptimal if the inputs have large fanout. We give an algor...
متن کاملSpan-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas
The formula-evaluation problem is defined recursively. A formula’s evaluation is the evaluation of a gate, the inputs of which are themselves independent formulas. Despite this pure recursive structure, the problem is combinatorially difficult for classical computers. A quantum algorithm is given to evaluate formulas over any finite boolean gate set. Provided that the complexities of the input ...
متن کاملDiscrete-Query Quantum Algorithm for NAND Trees
Recently, Farhi, Goldstone, and Gutmann gave a quantum algorithm for evaluating nand trees that runs in time O( √ N logN) in the Hamiltonian query model. In this note, we point out that their algorithm can be converted into an algorithm using O(N) queries in the conventional quantum query model, for any fixed ǫ > 0. A nand tree of depth n is a balanced binary tree whose internal vertices repres...
متن کاملQuantum algorithms for formula evaluation
We survey the recent sequence of algorithms for evaluating Boolean formulas consisting of NAND gates.
متن کاملJava Application that Outputs Quantum Circuit for Some NAND Formula Evaluators
This paper introduces QuanFruit v1.1, a Java application available for free. (Source code included in the distribution.) Recently, Farhi-Goldstone-Gutmann (FGG) wrote a paper arXiv:quant-ph/0702144 that proposes a quantum algorithm for evaluating NAND formulas. QuanFruit outputs a quantum circuit for the FFG algorithm.
متن کامل